Souslin partitions of products of finite sets
نویسندگان
چکیده
منابع مشابه
Countable Products of Spaces of Finite Sets
σn(Γ) = {x ∈ {0, 1} Γ : |supp(x)| ≤ n}. Here supp(x) = {γ ∈ Γ : xγ 6= 0}. This is a closed, hence compact subset of {0, 1}, which is identified with the family of all subsets of Γ of cardinality at most n. In this work we will study the spaces which are countable products of spaces σn(Γ), mainly their topological classification as well as the classification of their Banach spaces of continuous ...
متن کاملHomogeneously Souslin sets in small inner models
We prove that every homogeneously Souslin set is coanalytic provided that either (a) 0long does not exist, or else (b) V = K, where K is the core model below a μ-measurable cardinal. 1 Homogeneously Souslin sets. In this paper we shall deal with homogeneously Souslin sets of reals, or rather with sets of reals which admit an ω-closed embedding normal form. Definition 1.1 (Cf. [4, p. 92].) Let A...
متن کاملbuckling of viscoelastic composite plates using the finite strip method
در سال های اخیر، تقاضای استفاده از تئوری خطی ویسکوالاستیسیته بیشتر شده است. با افزایش استفاده از کامپوزیت های پیشرفته در صنایع هوایی و همچنین استفاده روزافزون از مواد پلیمری، اهمیت روش های دقیق طراحی و تحلیل چنین ساختارهایی بیشتر شده است. این مواد جدید از خودشان رفتارهای مکانیکی ارائه می دهند که با تئوری های الاستیسیته و ویسکوزیته، نمی توان آن ها را توصیف کرد. این مواد، خواص ویسکوالاستیک دارند....
Souslin Absoluteness, Uniformization and Regularity Properties of Projective Sets
We show that Souslin Absoluteness and Projective Regularity holds ii Souslin Uniformization does. As a result, Souslin Absoluteness plus 1 n Projective Regularity implies 1 n+1 Projective Regularity. Another result is that 1 5 Souslin Absoluteness implies 1 4 Projective Regularity, and 1 6 Souslin Absoluteness implies 1 5 Projective Regularity.
متن کاملCoding Partitions of Regular Sets
A coding partition of a set of words partitions this set into classes such that whenever a sequence, of minimal length, has two distinct factorizations, the words of these factorizations belong to the same class. The canonical coding partition is the finest coding partition that partitions the set of words in at most one unambiguous class and other classes that localize the ambiguities in the f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Mathematics
سال: 2003
ISSN: 0001-8708
DOI: 10.1016/s0001-8708(02)00064-6